Discrete Schur-constant models
نویسندگان
چکیده
منابع مشابه
Discrete Schur-constant models
This paper introduces a class of Schur-constant survival models, of dimension n, for arithmetic non-negative random variables. Such a model is defined through a univariate survival function that is shown to be n-monotone. Two general representations are obtained, by conditioning on the sum of the n variables or through a doubly mixed multinomial distribution. Several other properties including ...
متن کاملSome properties of Schur-constant survival models and their copulas
We study continuous, nonnegative random variables with a Schur-constant joint survival function. We show that these distributions are characterized by having an Archimedean survival copula, determine the distributions of certain functions of the random variables, and examine dependence properties and correlation coefficients for random variables with Schur-constant survival functions.
متن کاملSchur function expansion for normal matrix model and associated discrete matrix models
We consider Schur function expansion for the partition function of the model of normal matrices. We show that this expansion coincides with Takasaki expansion [5] for tau functions of Toda lattice hierarchy. We show that the partition function of the model of normal matrices is, at the same time, a partition function of certain discrete models, which can be solved by the method of orthogonal po...
متن کاملStochastic Models for Pricing Weather Derivatives using Constant Risk Premium
‎Pricing weather derivatives is becoming increasingly useful‎, ‎especially in developing economies‎. ‎We describe a statistical model based approach for pricing weather derivatives by modeling and forecasting daily average temperatures data which exhibits long-range dependence‎. ‎We pre-process the temperature data by filtering for seasonality and volatility an...
متن کاملConstant-time Discrete Gaussian Sampling
Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret. In this paper, we propose a constant-time implementation of the Knuth-Yao random walk algorithm for performing c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2015
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2015.06.003